Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implemented binary indexed tree. #949

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Conversation

st235
Copy link

@st235 st235 commented Oct 1, 2020

Checklist

  • I've looked at the contribution guidelines.
  • This pull request is complete and ready for review.

Description

Implemented Binary Indexed (Fenwick) tree. Fenwick Tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.

@st235
Copy link
Author

st235 commented Oct 1, 2020

Hi Algorithm Club 👋

Thank you for such a nice and unique repository! I really appreciate what you do here and really love algorithms like you. I found there are no Fenwick tree data structure and implemented it on my own to make this repo a little bit better. Hopefully, you will like the proposed changes.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant